Elementary Proofs of Some Classical Stability Criteria
نویسندگان
چکیده
Classical stability results and tests on the stability of a given polynomial are proved and derived here using a simple continuity property. The resulting new proofs given of the Hermite-Bielei theorem and the Routh and Jury tests are elementary and insightful. Most important, the proofs given here would allow the instructor to present these fundamental topics of control theory, for the first time, in an elementary, rational, and meaningful way rather than as mere sets of rules and formulae.
منابع مشابه
On the pointfree counterpart of the local definition of classical continuous maps
The familiar classical result that a continuous map from a space $X$ to a space $Y$ can be defined by giving continuous maps $varphi_U: U to Y$ on each member $U$ of an open cover ${mathfrak C}$ of $X$ such that $varphi_Umid U cap V = varphi_V mid U cap V$ for all $U,V in {mathfrak C}$ was recently shown to have an exact analogue in pointfree topology, and the same was done for the familiar cla...
متن کاملElementary submodels in infinite combinatorics
We show that usage of elementary submodels is a simple but powerful method to prove theorems, or to simplify proofs in infinite combinatorics. First we introduce all the necessary concepts of logic, then we prove classical theorems using elementary submodels. We also present a new proof of Nash-Williams’s theorem on cycle-decomposition of graphs, and finally we obtain some new decomposition the...
متن کاملStability of Symplectic Leaves
We find computable criteria for stability of symplectic leaves of Poisson manifolds. Using Poisson geometry as an inspiration, we also give a general criterion for stability of leaves of Lie algebroids, including singular ones. This not only extends but also provides a new approach (and proofs) to the classical stability results for foliations and group actions.
متن کاملSome Pitfalls of LK-to-LJ Translations and How to Avoid Them
In this paper, we investigate translations from a classical cut-free sequent calculus LK into an intuitionistic cut-free sequent calculus LJ. Translations known from the literature rest on permutations of inferences in classical proofs. We show that, for some classes of rst-order formulae, all minimal LJ-proofs are non-elementary but there exist short LK-proofs of the same formula. Similar resu...
متن کاملElementary Elimination of Prenex Cuts in Disjunction-free Intuitionistic Logic
The size of shortest cut-free proofs of first-order formulas in intuitionistic sequent calculus is known to be non-elementary in the worst case in terms of the size of given sequent proofs with cuts of the same formulas. In contrast to that fact, we provide an elementary bound for the size of cut-free proofs for disjunction-free intuitionistic logic for the case where the cut-formulas of the or...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004